Two Uncertain Programming Models for Inverse Minimum Spanning Tree Problem
نویسندگان
چکیده
An inverse minimum spanning tree problem makes the least modification on the edge weights such that a predetermined spanning tree is a minimum spanning tree with respect to the new edge weights. In this paper, the concept of uncertain α-minimum spanning tree is initiated for minimum spanning tree problem with uncertain edge weights. Using different decision criteria, two uncertain programming models are presented to formulate a specific inverse minimum spanning tree problem with uncertain edge weights involving a sum-type model and a minimax-type model. By means of the operational law of independent uncertain variables, the two uncertain programming models are transformed to their equivalent deterministic models which can be solved by classic optimization methods. Finally, some numerical examples on a traffic network reconstruction problem are put forward to illustrate the effectiveness of the proposed models.
منابع مشابه
A Chance-Constrained Programming Model for Inverse Spanning Tree Problem with Uncertain Edge Weights
The inverse spanning tree problem is to make a given spanning tree be a minimum spanning tree on a connected graph via a minimum perturbation on its edge weights. In this paper, a chance-constrained programming model is proposed to handle the inverse spanning tree problem where the edge weights are assumed to be uncertain variables. It is shown that such an uncertain minimum spanning tree can b...
متن کاملSpanning Tree Problem of Uncertain Network
In this paper we consider a spanning tree problem of uncertain network, which is a natural uncertain variation of the deterministic minimum spanning tree problem. By means of uncertainty theory, we propose three types of minimum spanning tree models for uncertain network, i.e., expected minimum spanning tree, α-minimum spanning tree, and distribution minimum spanning tree. Generally, we can the...
متن کاملModels and hybrid algorithms for inverse minimum spanning tree problem with stochastic edge weights∗
An inverse minimum spanning tree problem is to make the least modification on the edge weights such that a predetermined spanning tree is a minimum spanning tree with respect to the new edge weights. In this paper, the inverse minimum spanning tree problem with stochastic edge weights is investigated. The concept of α-minimum spanning tree is initiated, and subsequently an α-minimum spanning tr...
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملStochastic Inverse Minimum Spanning Tree Problem†
An inverse minimum spanning tree problem is to make the least modification on the edge weights such that a predetermined spanning tree is a minimum spanning tree with respect to the new edge weights. In this paper, the stochastic inverse minimum spanning tree problem is investigated. The concept of α-minimum spanning tree is initiated, and subsequently an α-minimum spanning tree model and a pro...
متن کامل